The Kernelized Taylor Diagram
نویسندگان
چکیده
Abstract This paper presents the kernelized Taylor diagram, a graphical framework for visualizing similarities between data populations. The diagram builds on widely used which is to visualize However, has several limitations such as not capturing non-linear relationships and sensitivity outliers. To address limitations, we propose diagram. Our proposed capable of populations with minimal assumptions distributions. relates maximum mean discrepancy kernel embedding in single construction that, best our knowledge, have been devised prior this work. We believe that can be valuable tool visualization.
منابع مشابه
Corrections to the theory and the optimal line in the swimming diagram of Taylor (1952).
The analysis of undulatory swimming gaits requires knowledge of the fluid forces acting on the animal body during swimming. In his classical 1952 paper, Taylor analysed this problem using a 'resistive-force' theory. The theory was used to characterize the undulatory gaits that result in the smallest energy dissipation to the fluid for a given swim velocity. The optimal gaits thus found were com...
متن کاملThe Kernelized Stochastic Batch Perceptron
We present a novel approach for training kernel Support Vector Machines, establish learning runtime guarantees for our method that are better then those of any other known kernelized SVM optimization approach, and show that our method works well in practice compared to existing alternatives.
متن کاملKernelized Bayesian Transfer Learning
Transfer learning considers related but distinct tasks defined on heterogenous domains and tries to transfer knowledge between these tasks to improve generalization performance. It is particularly useful when we do not have sufficient amount of labeled training data in some tasks, which may be very costly, laborious, or even infeasible to obtain. Instead, learning the tasks jointly enables us t...
متن کاملKernelized Infomax Clustering
We propose a simple information-theoretic approach to soft clustering based on maximizing the mutual information I(x, y) between the unknown cluster labels y and the training patterns x with respect to parameters of specifically constrained encoding distributions. The constraints are chosen such that patterns are likely to be clustered similarly if they lie close to specific unknown vectors in ...
متن کاملKernelized Support Tensor Machines
In the context of supervised tensor learning, preserving the structural information and exploiting the discriminative nonlinear relationships of tensor data are crucial for improving the performance of learning tasks. Based on tensor factorization theory and kernel methods, we propose a novel Kernelized Support Tensor Machine (KSTM) which integrates kernelized tensor factorization with maximum-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in computer and information science
سال: 2022
ISSN: ['1865-0937', '1865-0929']
DOI: https://doi.org/10.1007/978-3-031-17030-0_10